A fast algorithm to establish arc-consistency in constraint networks
نویسنده
چکیده
In [1], Bessière and Cordier said that the AC-6 arc-consistency algorithm is optimal in time on constraint networks where nothing is known about the constraint semantics. However, in constraint networks, it is always assumed that constraints are symmetric. None of the previous algorithms achieving arc-consistency (AC-3, AC-4, AC-6) use this property. We propose here an improved version of AC-6 (the best known algorithm for arc-consistency), which uses this property.
منابع مشابه
Using the symmetry of relations to establish arc-consistency in constraint networks
In [1, 2], Bessière and Cordier said that the AC-6 arc-consistency algorithm is optimal in time on constraint networks where nothing is known about the constraint semantics. However, in constraint networks, it is always assumed that constraints are symmetric. None of the previous algorithms achieving arc-consistency (AC-3 [5, 6], AC-4 [7], AC-6) use this property. We propose here an improved ve...
متن کاملA Greedy Approach to Establish Singleton Arc Consistency
In this paper, we propose a new approach to establish Singleton Arc Consistency (SAC) on constraint networks. While the principle of existing SAC algorithms involves performing a breadth-first search up to a depth equal to 1, the principle of the two algorithms introduced in this paper involves performing several runs of a greedy search (where at each step, arc consistency is maintained). It is...
متن کاملArc consistency for general constraint networks : preliminary
Constraint networks are used more and more to solve combinatorial problems in real-life applications. Much activity is concentrated on improving the eeciency of nding a solution in a constraint network (the constraint satisfaction problem, CSP). Particularly, arc consistency caught many researchers' attention, involving the discovery of a large number of algorithms. And, for the last two years,...
متن کاملProbabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of a well known algorithm for arc consistency used in constraint reasoning, and a specialization of the belief updating algorithm for singly-connected networks. Our algorithm is exact for singlyconnected constraint probl...
متن کاملUne approche gloutonne pour établir la singleton consistance d ’ arc Stéphane
In this paper, we propose a new approach to establish Singleton Arc Consistency (SAC) on constraint networks. While the principle of existing SAC algorithms involves performing a breadth-first search up to a depth equal to 1, the principle of the two algorithms introduced in this paper involves performing several runs of a greedy search (where at each step, arc consistency is maintained). It is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994